A Scalable Approach to Capacitated Arc Routing Problems Based on Hierarchical Decomposition
نویسندگان
چکیده
منابع مشابه
A hybrid metaheuristic approach for the capacitated arc routing problem
The capacitated arc routing problem (CARP) is a difficult combinatorial optimization problem that has been intensively studied in the last decades. We present a hybrid metaheuristic approach (HMA) to solve this problem which incorporates an effective local refinement procedure, coupling a randomized tabu thresholding procedure with an infeasible descent procedure, into the memetic framework. Ot...
متن کاملProfitable Mixed Capacitated Arc Routing and Related Problems
Mixed Capacitated Arc Routing Problems (MCARP) aim to identify a set of vehicle trips that, starting and ending at a depot node, serve a given number of links, regarding the vehicles capacity, and minimizing a cost function. If both profits and costs on arcs are considered, the Profitable Mixed Capacitated Arc Routing Problem (PMCARP) may be defined. We present compact flow based models for the...
متن کاملMultiobjective Capacitated Arc Routing Problem
The Capacitated Arc Routing Problem (CARP) is a very hard vehicle routing problem raised for instance by urban waste collection. In addition to the total route length (the only criterion minimized in the academic problem), waste management companies seek to minimize also the length of the longest trip. A bi-objective genetic algorithm is presented for this more realistic CARP, never studied bef...
متن کاملApproximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems
We show that any α(n)-approximation algorithm for the n-vertex metric asymmetric Traveling Salesperson problem yields O(α(C))-approximation algorithms for various mixed, windy, and capacitated arc routing problems. Herein, C is the number of weakly-connected components in the subgraph induced by the positive-demand arcs, a number that can be expected to be small in applications. In conjunction ...
متن کاملEvolutionary Algorithms for Capacitated Arc Routing problems with Time Windows
The Capacitated Arc Routing Problem (CARP) involves vehicles routing, serving a set of arcs in a network. This NP hard problem is extended to take into account time windows, entailing a new and hard theoretical model in arc routing called the CARPTW (CARP with time windows). The CARPTW is useful for modeling urban waste collection or winter gritting. This paper presents this new model and a mem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Cybernetics
سال: 2017
ISSN: 2168-2267,2168-2275
DOI: 10.1109/tcyb.2016.2590558